A holding cost bound for the economic lot-sizing problem with time-invariant cost parameters
نویسندگان
چکیده
منابع مشابه
A holding cost bound for the economic lot-sizing problem with time-invariant cost parameters
In this paper we derive a new structural property for an optimal solution of the economic lot-sizing problem with time-invariant cost parameters. We show that the total holding cost in an order interval of an optimal solution is bounded from above by a quantity proportional to the setup cost and the logarithm of the number of periods in the interval. Since we can also show that this bound is ti...
متن کاملAn FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure
We present a fully polynomial time approximation scheme (FPTAS) for a capacitated economic lot-sizing problem with a monotone cost structure. An FPTAS delivers a solution with a given relative error ε in time polynomial in the problem size and in 1/ε. Such a scheme was developed by van Hoesel and Wagelmans [8] for a capacitated economic lot-sizing problem with monotone concave (convex) producti...
متن کاملCost Sharing for the Economic Lot-Sizing Problem with Remanufacturing Options
We consider a new class of cooperative cost sharing games, associated with the economic lot-sizing problem with remanufacturing options (ELSR). As a preliminary step, we investigate the relative strength and integrality gaps of various mathematical optimization formulations of ELSR. Using insights from these results, we study the core of the associated cost sharing game. We show that the cost s...
متن کاملDynamic cost allocation for economic lot sizing games
We consider a cooperative game defined by an economic lot sizing problem with concave ordering costs over a finite time horizon, in which each player faces demand for a single product in each period and coalitions can pool orders. We show how to compute a dynamic cost allocation in the strong sequential core of this game, i.e. an allocation over time that exactly distributes costs and is stable...
متن کاملA POLYNOMIAL TIME BRANCH AND BOUND ALGORITHM FOR THE SINGLE ITEM ECONOMIC LOT SIZING PROBLEM WITH ALL UNITS DISCOUNT AND RESALE
The purpose of this paper is to present a polynomial time algorithm which determines the lot sizes for purchase component in Material Requirement Planning (MRP) environments with deterministic time-phased demand with zero lead time. In this model, backlog is not permitted, the unit purchasing price is based on the all-units discount system and resale of the excess units is possible at the order...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2009
ISSN: 0167-6377
DOI: 10.1016/j.orl.2008.12.006